A Topology-Aware Random Walk
نویسندگان
چکیده
When a graph can be decomposed into clusters of well connected subgraphs, it is possible to speed up random walks taking advantage of the topology of the graph. In this work, a new random walk scheme is introduced and a condition is given when the new random walk performs better than the Metropolis algorithm.
منابع مشابه
Evaluating the Quality of a Network Topology through Random Walks
In this brief announcement we propose a distributed algorithm to assess the connectivity quality of a network, be it physical or logical. In large complex networks, some nodes may play a vital role due to their position (e.g. for routing or network reliability). Assessing global properties of a graph, as importance of nodes, usually involves lots of communications; doing so while keeping the ov...
متن کاملTopology-Aware Hybrid Random Walk Protocols for Wireless Multihop Networks
The proliferation of wireless multihop networks has made various operations, such as search and retrieval of distributed data a significant concern. Various methods have been proposed for performing such tasks efficiently, especially when all network nodes need to be visited at least once. Random walks are probabilistic approaches for performing the aforementioned operations effectively and wit...
متن کاملTAC: A Topology-Aware Chord-based Peer-to-Peer Network
Among structured Peer-to-Peer systems, Chord has a general popularity due to its salient features like simplicity, high scalability, small path length with respect to network size, and flexibility on node join and departure. However, Chord doesn’t take into account the topology of underlying physical network when a new node is being added to the system, thus resulting in high routing late...
متن کاملOn the Success of Network Topology Inference using a Markov Random Walk Model for Nested Routing Policies
Network topology inference is a topic of ongoing interest, as researchers continue to try to identify the topology of the internet, other networks, and our own networks for maintenance purposes. In this paper we explain why a simple algorithm based on network co-occurrence measurements and a Markov random walk model for routing enables perfect topology reconstruction, despite the seeming model ...
متن کاملA Random Walk with Exponential Travel Times
Consider the random walk among N places with N(N - 1)/2 transports. We attach an exponential random variable Xij to each transport between places Pi and Pj and take these random variables mutually independent. If transports are possible or impossible independently with probability p and 1-p, respectively, then we give a lower bound for the distribution function of the smallest path at point log...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEICE Transactions
دوره 95-B شماره
صفحات -
تاریخ انتشار 2012